github.com/klauspost/compress/zstd.doubleFastEncoderDict.longTable (field)

18 uses

	github.com/klauspost/compress/zstd (current package)
		enc_dfast.go#L32: 	longTable           [dFastLongTableSize]tableEntry
		enc_dfast.go#L692: 			for i := range e.longTable[:] {
		enc_dfast.go#L693: 				e.longTable[i] = tableEntry{}
		enc_dfast.go#L710: 		for i := range e.longTable[:] {
		enc_dfast.go#L711: 			v := e.longTable[i].offset
		enc_dfast.go#L717: 			e.longTable[i].offset = v
		enc_dfast.go#L774: 			candidateL := e.longTable[nextHashL]
		enc_dfast.go#L780: 			e.longTable[nextHashL] = entry
		enc_dfast.go#L856: 				candidateL = e.longTable[nextHashL]
		enc_dfast.go#L860: 				e.longTable[nextHashL] = tableEntry{offset: s + checkAt + e.cur, val: uint32(cv)}
		enc_dfast.go#L951: 		e.longTable[longHash1] = te0
		enc_dfast.go#L952: 		e.longTable[longHash2] = te1
		enc_dfast.go#L991: 			e.longTable[nextHashL] = entry
		enc_dfast.go#L1050: 	if len(e.dictLongTable) != len(e.longTable) || dictChanged {
		enc_dfast.go#L1051: 		if len(e.dictLongTable) != len(e.longTable) {
		enc_dfast.go#L1052: 			e.dictLongTable = make([]tableEntry, len(e.longTable))
		enc_dfast.go#L1087: 		e.longTable = *(*[dFastLongTableSize]tableEntry)(e.dictLongTable)
		enc_dfast.go#L1099: 		*(*[dLongTableShardSize]tableEntry)(e.longTable[i*dLongTableShardSize:]) = *(*[dLongTableShardSize]tableEntry)(e.dictLongTable[i*dLongTableShardSize:])